Solving the Multidimensional Knapsack Problem Using an Evolutionary Algorithm Hybridized with Branch and Bound
نویسندگان
چکیده
A hybridization of an evolutionary algorithm (EA) with the branch and bound method (B&B) is presented in this paper. Both techniques cooperate by exchanging information, namely lower bounds in the case of the EA, and partial promising solutions in the case of the B&B. The multidimensional knapsack problem has been chosen as a benchmark. To be precise, the algorithms have been tested on large problems instances from the OR-library. As it will be shown, the hybrid approach can provide high quality results, better than those obtained by the EA and the B&B on their own.
منابع مشابه
An Exact Cooperative Method for Solving the 0-1 Multidimensional Knapsack Problem
This article presents an exact cooperative method for solving the Multidimensional Knapsack Problem (MKP ) which combines dynamic programming and branch and bound. The first step of our algorithm tries to find out a good feasible solution of the (MKP ) using surrogate relaxation. For this purpose, we have developed a modified dynamic programming algorithm. The second step is based on a branch a...
متن کاملSolving the 0-1 Multidimensional Knapsack Problem with Resolution Search
We propose an exact method which combines the resolution search and branch & bound algorithms for solving the 0–1 Multidimensional Knapsack Problem. This algorithm is able to prove large–scale strong correlated instances. The optimal values of the 10 constraint, 500 variable instances of the OR-Library are exposed. These values were previously unknown.
متن کاملAn Algorithm Based on Theory of Constraints and Branch and Bound for Solving Integrated Product-Mix-Outsourcing Problem
One of the most important decision making problems in many production systems is identification and determination of products and their quantities according to available resources. This problem is called product-mix. However, in the real-world situations, for existing constrained resources, many companies try to provide some products from external resources to achieve more profits. In this pape...
متن کاملSolution of Multidimensional Knapsack Problem via Cooperation of Dynamic Programming and Branch and Bound
This article presents an exact cooperative method for the solution of the Multidimensional Knapsack Problem (MKP ) which combines dynamic programming and branch and bound. Our method makes cooperate a dynamic programming heuristics based on surrogate relaxation and a branch and bound procedure. Our algorithm was tested for several randomly generated test sets and problems in the literature. Sol...
متن کاملAn Efficient Algorithm for Reducing the Duality Gap in a Special Class of the Knapsack Problem
A special class of the knapsack problem is called the separable nonlinear knapsack problem. This problem has received considerable attention recently because of its numerous applications. Dynamic programming is one of the basic approaches for solving this problem. Unfortunately, the size of state-pace will dramatically increase and cause the dimensionality problem. In this paper, an efficient a...
متن کامل